package bTree.LeetCode;

public class 最长公共子序列 {
    public int longestCommonSubsequence(String text1, String text2) {
        int len1=text1.length();
        int len2=text2.length();
        int [][]dp=new int[len2+1][len1+1];
        for(int i=0;i<=len1;i++){
            dp[0][i]=0;
        }
        for(int i=0;i<=len2;i++){
            dp[i][0]=0;
        }
        for(int i=1;i<=len2;i++){
            for(int j=1;j<=len1;j++){
                if(text2.charAt(i-1)==text1.charAt(j-1)){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else{
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[len2][len1];
    }
}